A non-binary constraint ordering heuristic for constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
A non-binary constraint ordering heuristic for constraint satisfaction problems
Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of constraint satisfaction. Furthermore, the order in which constraints are studied can improve efficie...
متن کاملEncodings of Non-Binary Constraint Satisfaction Problems
We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of non-binary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations. This translation suggests that we will tend to achieve more pruning in the dual than in the hidden va...
متن کاملA Generator for Random Non-Binary Finite Constraint Satisfaction Problems
The paper describes an implementation of a generator of random instances of non-binary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in [1]. 1 Description The program is designed to generate random instances of Constraint Satisfaction Problems (CSPs) that meet a set of specified parameters, such as the number of variable...
متن کاملHeuristic Search For Distributed Constraint Satisfaction Problems
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classiied as variable-based, domain-based, and function-based distributed problem solving strategies. In this paper, some heu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2008
ISSN: 0096-3003
DOI: 10.1016/j.amc.2007.08.064